Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
191	November[removed]LIDS-P-2276 RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems Add to Reading List Source URL: web.mit.edu Language: English - Date: 2001-07-10 15:50:54 Systems scientists Network flow Operations research Convex optimization Auction algorithm Dimitri Bertsekas Interior point method Minimum-cost flow problem Shortest path problem Mathematics Applied mathematics Mathematical optimization
192	Combinatorial Optimization and Statistical Physics Phillip M. Duxbury, Condensed Matter Theory, MSU Add to Reading List Source URL: www.pa.msu.edu Language: English - Date: 2007-02-21 08:51:29 Combinatorial optimization Spanning tree Lattice models Network theory Ising model Cut Matching Maximum flow problem Shortest path problem Mathematics Theoretical computer science Graph theory
193	All Friends are Not Equal: Using Weights in Social Graphs to Improve Search Sudheendra Hangal Diana MacLean Add to Reading List Source URL: mobisocial.stanford.edu Language: English - Date: 2010-08-21 16:25:26 Network theory Networks Shortest path problem Routing algorithms Flow network Interpersonal ties Routing Graph Network science Graph theory Mathematics Theoretical computer science
194	Computing Replacement Paths in Surface Embedded Graphs∗ Jeff Erickson Amir Nayyeri Department of Computer Science Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:11:19 Network theory Combinatorial optimization Shortest path problem Routing algorithms Matching Maximum flow problem Eulerian path Dynamic programming Graph Graph theory Mathematics Theoretical computer science
195	Counting and Sampling Minimum Cuts in Genus g Graphs Erin W. Chambers∗ Kyle Fox† Amir Nayyeri‡ Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2013-09-03 13:18:47 Maximum flow problem Network flow Tree Matching Minimum spanning tree Minimum cut Graph Connectivity Directed acyclic graph Graph theory Mathematics Combinatorial optimization
196	Optimal Gradient Clock Synchronization in Dynamic Networks Fabian Kuhn Christoph Lenzen Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-07-29 05:34:11 Theoretical computer science Synchronization Network theory Clock signal Clock skew Flow network Connectivity Shortest path problem Clock synchronization Graph theory Mathematics Network flow
197	Optimal Gradient Clock Synchronization in Dynamic Networks (Technical Report) Fabian Kuhn1 Christoph Lenzen2 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-08-16 10:36:31 Network flow Synchronization Flow network Operations research Clock skew Connectivity Clock synchronization Shortest path problem Ford–Fulkerson algorithm Graph theory Mathematics Theoretical computer science
198	CS 170 Fall 2006 — Discussion Handout #7 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 17:09:00 Network flow NP-complete problems Combinatorial optimization Maximum flow problem Flow network Vertex cover Matching Bipartite graph Connectivity Graph theory Mathematics Theoretical computer science
199	CS 170 Fall 2006 — Discussion Handout #8 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 16:42:32 Operations research Network theory NP-complete problems Convex optimization Linear programming Shortest path problem Maximum flow problem Simplex algorithm Vertex cover Graph theory Mathematics Theoretical computer science
200	A normalization strategy for comparing tag count data Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Network flow Network theory Shortest path problem Steiner tree problem Flow network Spanning tree Graph theory Theoretical computer science Mathematics

UPDATE